A Fast Non-Smooth Nonnegative Matrix Factorization for Learning Sparse Representation
نویسندگان
چکیده
منابع مشابه
Sparse Deep Nonnegative Matrix Factorization
Nonnegative matrix factorization is a powerful technique to realize dimension reduction and pattern recognition through single-layer data representation learning. Deep learning, however, with its carefully designed hierarchical structure, is able to combine hidden features to form more representative features for pattern recognition. In this paper, we proposed sparse deep nonnegative matrix fac...
متن کاملExtended Sparse Nonnegative Matrix Factorization
In sparse nonnegative component analysis (sparse NMF) a given dataset is decomposed into a mixing matrix and a feature data set, which are both nonnegative and fulfill certain sparsity constraints. In this paper, we extend the sparse NMF algorithm to allow for varying sparsity in each feature and discuss the uniqueness of an involved projection step. Furthermore, the eligibility of the extended...
متن کاملBayesian Group Sparse Learning for Nonnegative Matrix Factorization
Nonnegative matrix factorization (NMF) is developed for parts-based representation of nonnegative data with the sparseness constraint. The degree of sparseness plays an important role for model regularization. This paper presents Bayesian group sparse learning for NMF and applies it for single-channel source separation. This method establishes the common bases and individual bases to characteri...
متن کاملSparse Nonnegative Matrix Factorization for Clustering
Properties of Nonnegative Matrix Factorization (NMF) as a clustering method are studied by relating its formulation to other methods such as K-means clustering. We show how interpreting the objective function of K-means as that of a lower rank approximation with special constraints allows comparisons between the constraints of NMF and K-means and provides the insight that some constraints can b...
متن کاملUsing underapproximations for sparse nonnegative matrix factorization
Nonnegative Matrix Factorization (NMF) has gathered a lot of attention in the last decade and has been successfully applied in numerous applications. It consists in the factorization of a nonnegative matrix by the product of two low-rank nonnegative matrices: M ≈ VW . In this paper, we attempt to solve NMF problems in a recursive way. In order to do that, we introduce a new variant called Nonne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2016
ISSN: 2169-3536
DOI: 10.1109/access.2016.2605704